A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients
نویسندگان
چکیده
progressive image compression, Laplacian density, run-length coding, rate distortion We present a new low-complexity method for modeling and coding the bitplanes of a wavelet-transformed image in a fully embedded fashion. The scheme uses a simple ordering model for embedding, based on the principle that coefficient bits that are likely to reduce the distortion the most should be described first in the encoded bitstream. The ordering model is tied to a conditioning model in a way that deinterleaves the conditioned subsequences of coefficient bits, making them amenable to coding with a very simple, adaptive elementary Golomb code. The proposed scheme, without relying on zerotrees or arithmetic coding, attains PSNR vs. bit rate performance superior to that of SPIHT, and competitive with its arithmetic coding variant, SPIHT-AC.
منابع مشابه
Embedded Image Coding Using ZeroBlocks of Subband/Wavelet Coefficients and Context Modeling
With fast computation and excellent compression efficiency, two embedded coding techniques, zero-tree/-block coding and context modeling of the subband/wavelet coefficients, have been widely utilized for image coding applications. In this research, we present a new embedded wavelet image coding algorithmwith an attempt to combine advantages of these two successful coding schemes. The experiment...
متن کاملLow-complexity and low-memory entropy coder for image compression
In this paper, a low-complexity and low-memory entropy coder (LLEC) is proposed for image compression. The two key elements in the LLEC are zerotree coding and Golomb–Rice (G–R) codes. Zerotree coding exploits the zerotree structure of transformed coefficients for higher compression efficiency. G–R codes are used to code the remaining coefficients in a variable-length codes/variable-length inte...
متن کاملContext modeling and entropy coding of wavelet coefficients for image compression
In this paper we study the problem of context modeling and entropy coding of the symbol streams generated by the well-known EZW image coder (embedded image coding using zerotrees of wavelet coe cients). We present some simple context modeling techniques that can squeeze out more statistical redundancy in the wavelet coe cients of EZW-type image coders and hence lead to improved coding e ciency.
متن کاملSBHP-a low complexity wavelet coder
We present a low-complexity entropy coder originally designed to work in the JPEG2000 image compression standard framework. The algorithm is meant for embedded and non-embedded coding of wavelet coefficients inside a subband, and is called Subband-Block Hierarchical Partitioning (SBHP). It was extensively tested following the standard experiment procedures, and it was shown to yield a significa...
متن کاملSatellite image compression by concurrent representations of wavelet blocks
This paper proposes a complete compression and coding scheme for onboard satellite applications considering the main on-board constraints: low computational power and easy bit-rate control. The proposed coding scheme improves the performance of the current CCSDS recommendation (Consultative Committee for Space Data Systems) for a low additional complexity. We consider post-transforms in the wav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998